The Joint International Conference on Logic Programming, sponsored by the Association for Logic Programming, is a major forum for presentations of research, applications, and implementations in this important area of computer science. Logic programming is one of the most promising steps toward declarative programming and forms the theoretical basis of the programming language Prolog and its various extensions. Logic programming is also fundamental to work in artificial intelligence, where it (...) has been used for nonmonotonic and commonsense reasoning, expert systems implementation, deductive databases, and applications such as computer-aided manufacturing. Krzysztof R. Apt is project leader at the Centre for Mathematics and Computer Science in Amsterdam and part-time Professor in Computer Science at the University of Amsterdam. Topics covered: Theory Foundations. Programming Languages. Implementation. Programming Methodologies and Tools. Applications. Deductive Databases. Artificial Intelligence. Parallelism. (shrink)

These two volumes collect papers presented at the first joint meeting of the two principal logic programming conferences, held in August of 1988. The more than fifty contributions cover all aspects of the field, including applications (particularly those that exploit the unique character of logic programming), the role of logic programming in artificial intelligence, deductive databases, relations to other computational paradigms, language issues, methodology, implementations on sequential and parallel architectures, and theory.Logic Programming (...) is included in the Logic Programming series Research Reports and Notes, edited by Ehud Shapiro. (shrink)

This book constitutes the refereed proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2004, held in Fort Lauderdale, Florida, USA in January 2004. The 24 revised full papers presented together with 8 system descriptions were carefully reviewed and selected for presentation. Among the topics addressed are declarative logic programming, nonmonotonic reasoning, knowledge representation, combinatorial search, answer set programming, constraint programming, deduction in ontologies, and planning.

This book constitutes the refereed proceedings of the 20th International Conference on Logic Programming, ICLP 2004, held in Saint-Malo, France in September 2004. The 28 revised full papers and 16 poster papers presented together with 2 invited papers were carefully reviewed and selected from 70 submissions. The papers are organized in topical sections on program analysis, constraints, alternative programming paradigms, answer set programming, and implementation.

Includes tutorials, invited lectures, and refereed papers on all aspects of logic programming including: Constraints, Concurrency and Parallelism, Deductive Databases, Implementations, Meta and Higher-order Programming, Theory, and Semantic Analysis. September 2-6, 1996, Bonn, Germany Every four years, the two major international scientific conferences on logic programming merge in one joint event. JICSLP'96 is the thirteenth in the two series of annual conferences sponsored by The Association for Logic Programming. It includes tutorials, invited lectures, (...) and refereed papers on all aspects of logic programming including: Constraints, Concurrency and Parallelism, Deductive Databases, Implementations, Meta and Higher-order Programming, Theory, and Semantic Analysis. The contributors are international, with strong contingents from the United States, United Kingdom, France, and Japan. Logic Programming series, Research Reports and Notes. (shrink)

This book constitutes the refereed proceedings of the 10th International Conference on Inductive Logic Programming, ILP 2000, held in London, UK in July 2000 as past of CL 2000. The 15 revised full papers presented together with an invited paper were carefully reviewed and selected from 37 submissions. The papers address all current issues in inductive logic programming and inductive learning, from foundational aspects to applications in various fields like data mining, knowledge discovery, and ILP (...) system design. (shrink)

This volume presents a collection of refereed papers reflecting the state of the art in the area of over-constrained systems. Besides 11 revised full papers, selected from the 24 submissions to the OCS workshop held in conjunction with the First International Conference on Principles and Practice of Constraint Programming, CP '95, held in Marseilles in September 1995, the book includes three comprehensive background papers of central importance for the workshop papers and the whole field. Also included is an (...) introduction by one of the volume editors together with a bibliography listing 243 entries. All in all this is a very useful reference book relevant for all researchers and practitioners interested in hierarchical, partial, and over-constrained systems. (shrink)

The International Logic Programming Symposium is one of two major international conferences sponsored by the Association of Logic Programming. Both conferences are held annually. The theme for the 1995 conference was "Declarative Systems", particularly the integration of the logic programming, functional programming, and object-oriented programming paradigms.

This volume contains finalized versions of papers presented at an international workshop on extensions of logic programming, held at the Seminar for Natural Language Systems at the University of Tübingen in December 1989. Several recent extensions of definite Horn clause programming, especially those with a proof-theoretic background, have much in common. One common thread is a new emphasis on hypothetical reasoning, which is typically inspired by Gentzen-style sequent or natural deduction systems. This is not only of theoretical (...) significance, but also bears upon computational issues. It was one purpose of the workshop to bring some of these recent developments together. The volume covers topics such as the languages Lambda-Prolog, N-Prolog, and GCLA, the relationship between logic programming and functional programming, and the relationship between extensions of logic programming and automated theorem proving. It contains the results of the first conference concentrating on proof-theoretic approaches to logic programming. (shrink)

Workshop organized by Fraunhofer-Institut f'ur Arbeitswirtschaft und Organisation.".

These are the proceedings of the First International Conference on Compu- tional Logic (CL 2000) which was held at Imperial College in London from 24th to 28th July, 2000. The theme of the conference covered all aspects of the theory, implementation, and application of computational logic, where computational logic is to be understood broadly as the use of logic in computer science. The conference was collocated with the following events: { 6th International (...) class='Hi'>Conference on Rules and Objects in Databases (DOOD 2000) { 10th International Workshop on Logic-based Program Synthesis and Tra- formation (LOPSTR 2000) { 10th International Conference on Inductive Logic Programming (ILP 2000). CL 2000 consisted of seven streams: { Program Development (LOPSTR 2000) { Logic Programming: Theory and Extensions { Constraints { Automated Deduction: Putting Theory into Practice { Knowledge Representation and Non-monotonic Reasoning { Database Systems (DOOD 2000) { Logic Programming: Implementations and Applications. The LOPSTR 2000 workshop constituted the program development stream and the DOOD 2000 conference constituted the database systems stream. Each stream had its own chair and program committee, which autonomously selected the papers in the area of the stream. Overall, 176 papers were submitted, of which 86 were selected to be presented at the conference and appear in these proceedings. The acceptance rate was uniform across the streams. In addition, LOPSTR 2000 accepted about 15 extended abstracts to be presented at the conference in the program development stream. (shrink)

This volume contains several invited papers as well as a selection of the other contributions. The conference was the first meeting of the Soviet logicians interested in com- puter science with their Western counterparts. The papers report new results and techniques in applications of deductive systems, deductive program synthesis and analysis, computer experiments in logic related fields, theorem proving and logic programming. It provides access to intensive work on computer logic both in the USSR and (...) in Western countries. (shrink)

The three-yearly conference of Italian Society for Logic and Philosophy of Science (SILFS) has taken place in Bergamo, the 15th, 16th and 17th December 2010. The charming venue has been the former convent of Sant’Agostino, nowadays University of Bergamo. The conference program has been structured distinguishing plenary and parallel sessions: the first ones were 40 minutes long and designed for international guests: S. Abramsky from the Wolfson College of Oxford, A. Hagar from Indiana University, P. Janich from (...) Philipps Universitaet of Marburg and S. Okasha from University of Bristol. The complete program of the conference can be downloaded here: . We followed all the plenary sessions, and the first part of our report concerns them. There is just the exception of professor S. Psillos’ talk, which was indeed programmed, but didn’t take place due to greek unrest of the last December. The second part of our report concers the parallel sessions, that were 20 minutes long and designed for concurrent talks split between subject areas. We will keep this division into areas in our report and we chose four talks per area. However, it must be said that we had not watch the parallel sessions completely, since their being simoultaneous. This means that our review of the conference will be perspective, both because of subjective standpoint and because of the mentioned limitation. Still we hope we can offer a quite complete picture of the three-days conference, as we hope this overview may be considered as a general review of it. Just a few words must be still said to introduce to our review. The structure of each review will consists in a presentation of the talk’s author(s) (which we faithfully copy hereinafter) followed by a brief remark by us. Since many compliments could be surely done to the SILFS’ organization and to the University of Bergamo, an overall effect seems hard to be drawn, because of some arising perplexities. Although these are just our shared impressions about the conference, we think they must be remembered. One could note outward that the conference have had three official languages: English, French and Italian. Apparently, this is something that has not been justified since French has been useless and Italian has often prevented the comprehension by foreigner attendance. Many defections have taken place, something that could be said about the conformity with the program (in spite of the high number of speeches). Of course these defections have been caused by different reasons, but they become an indication of lack of professionalism as the number grows. Coming to an estimation of the inner issues, first we are seriously puzzled about the selection criterion (if any) which the SILFS has chosen the invited speakers with. One can notice that excellent talks have been put together to shallow speech without substantial scientific commitment. One has to keep in mind that who is just worthless, much lowers the general level. The topics have been various, although many were historical reconstruction and the "historiographic" approach in the study of Philosophy of Science seems therefore prevailing. Those talks whose subject was Logic and its applications, have been the highest-quality ones, by the fact that they were close to contemporary researches. More specifically, we would like to quote those concerning Quantum Computation and Logic of Quantum Mechanics. Talks of Philosophy of Biology and Cognitive Science were first-rate works, too, having showed high proficiency, though even specialistic topics were often technically handled, to the detriment of laymen (as us). (shrink)

This volume presents the proceedings of the Computer Science Logic Workshop CSL '92, held in Pisa, Italy, in September/October 1992. CSL '92 was the sixth of the series and the first one held as Annual Conference of the European Association for Computer Science Logic (EACSL). Full versions of the workshop contributions were collected after their presentation and reviewed. On the basis of 58 reviews, 26 papers were selected for publication, and appear here in revised final form. Topics (...) covered in the volume include: Turing machines, linear logic, logic of proofs, optimization problems, lambda calculus, fixpoint logic, NP-completeness, resolution, transition system semantics, higher order partial functions, evolving algebras, functional logic programming, inductive definability, semantics of C, classes for a functional language, NP-optimization problems, theory of types and names, sconing and relators, 3-satisfiability, Kleene's slash, negation-complete logic programs, polynomial-time oracle machines, and monadic second-order properties. (shrink)

The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that (...) can be found in human reasoning. Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (shrink)

The question standing in the backgrounds of this paper is what kind of hermeneutics can emerge on basis of philosophy of life. To answer it, the theories of German philosophers Georg Misch and Josef Koenig have been analyzed. The first developed hermeneutical logics, which is based on identification the notions ‘life’ and ‘articulation’ ). Three aspects –life as logical category, life as hermeneutical category, and the discoursive forms of self-representation of life- extracted from Misch’s theory seem to be relevant for (...) further development of hermeneutics. Koenig carries forward this research program, but focuses on the linguistic structures of human perception experience and drafts a kind of analytical hermeneutics. The remarkable part of both conceptions is that they pose it logical heterogenity of theoretical and practical discourses. These differences are relevant for rethinking of such epistemological phenomenon, such as ‘meaning’, ‘concept’, ‘truth’ and ‘knowledge’. According to these positions, hermeneutics can be a homogenous theory of interpretation or understanding, but on the contrary the different logical areas of hermeneutics must be constituted. Thus, hermeneutics can be interpreted as an alternative to the traditional, i.e., epistemological approach, to the theory of knowledge, on the one hand, and to analytical philosophy of language on the other. (shrink)

This volume presents the proceedings from the Eleventh Brazilian Logic Conference on Mathematical Logic held by the Brazilian Logic Society in Salvador, Bahia, Brazil. The conference and the volume are dedicated to the memory of professor Mario Tourasse Teixeira, an educator and researcher who contributed to the formation of several generations of Brazilian logicians. Contributions were made from leading Brazilian logicians and their Latin-American and European colleagues. All papers were selected by a careful refereeing processs (...) and were revised and updated by their authors for publication in this volume. There are three sections: Advances in Logic, Advances in Theoretical Computer Science, and Advances in Philosophical Logic. Well-known specialists present original research on several aspects of model theory, proof theory, algebraic logic, category theory, connections between logic and computer science, and topics of philosophical logic of current interest. Topics interweave proof-theoretical, semantical, foundational, and philosophical aspects with algorithmic and algebraic views, offering lively high-level research results. (shrink)

WoLLIC'2006 was held at the Center for the Study of Language and Information , Stanford University, USA, from July 18th to 21st, 2006. WoLLIC is a series of workshops which started in 1994 with the aim of fostering interdisciplinary research in pure and applied logic. The idea is to have a forum which is large enough in the number of possible interactions between logic and the sciences related to information and computation, and yet is small enough to allow (...) for concrete and useful interaction among participants. Previous versions were held at: Recife in 1994 and 1995; Salvador in 1996; Fortaleza in 1997; São Paulo in 1998; Itatiaia in 1999; Natal in 2000; Brasília in 2001; Rio de Janeiro in 2002; Ouro Preto in 2003; Fontainebleau in 2004; Florianópolis in 2005. It is planned that in 2007 it will be held in Rio de Janeiro, 2008 in Edinburgh , and 2009 in Japan . Scientific sponsorship comes from the Interest Group in Pure and Applied Logics , the European Association for Logic, Language and Information , the Association for Symbolic Logic , European Association for Theoretical Computer Science , the Sociedade Brasileira de Computação , and the Sociedade Brasileira de Lógica . Funding was kindly given by: The Tinker Foundation; The Office of the Provost, Stanford University; Center for the Study of Language and Information, Stanford University; Department of Philosophy, Stanford University; Department of Mathematics, Stanford University; Symbolic Systems Program, Stanford University. Contributions were received in the form of short papers in all areas related to logic, language, information and computation, including: context and situation theory; …. (shrink)

Inspired by the grammar of natural language, the paper presents a variant of first-order logic, in which quantifiers are not sentential operators, but are used as subnectors . A quantified term formed by a subnector is an argument of a predicate. The logic is defined by means of a meaning-conferring natural-deduction proof-system, according to the proof-theoretic semantics program. The harmony of the I/E-rules is shown. The paper then presents a translation, called the Frege translation, from the defined (...) class='Hi'>logic to standard first-order logic, and shows that the proof-theoretic meanings of both logics coincide. The paper criticizes Frege’s original regimentation of quantified sentences of natural language, and argues for advantages of the proposed variant. (shrink)

The more traditional approaches to the history and philosophy of science and technology continue as well, and probably will continue as long as there are skillful practitioners such as Carl Hempel, Ernest Nagel, and th~ir students. Finally, there are still other approaches that address some of the technical problems arising when we try to provide an account of belief and of rational choice. - These include efforts to provide logical frameworks within which we can make sense of these notions. This (...) series will attempt to bring together work from all of these approaches to the history and philosophy of science and technology in the belief that each has something to add to our understanding. The volumes of this series have emerged either from lectures given by authors while they served as honorary visiting professors at the City College of New York or from conferences sponsored by that institution. The City College Program in the History and Philosophy of Science and Technology oversees and directs these lectures and conferences with the financial aid of the Association for Philosophy of Science, Psychotheraphy, and Ethics. MARTIN TAMNY RAPHAEL STERN PREFACE The papers in this collection stem largely from the conference 'Foun dations: Logic, Language, and Mathematics' held at the Graduate Center of the City University of New York on 14-15 November 1980. (shrink)

These are the proceedings of the Workshop on Quantum Logic held in Erice (Sicily), December 2 - 9, 1979, at the Ettore Hajorana Centre for Scientific Culture. A conference of this sort was originally proposed by Giuliano Toraldo di Francia, who suggested the idea to Antonino Zichichi, and thus laid the foundation for the Workshop. To both of them we express our appreciation and thanks, also on behalf of the other participants, for having made this conference possible. (...) There were approximately fifty participants; their names and institutions are listed in the text. Quantum logic, which has now a history of some forty or more years, has seen remarkable growth during the sixties and seventies. The papers in the present volume presuppose, by and large, some acquaintance with the elements of the subject. These may be found in the well-known books by J.H. Jauch (Foundations of Quantum Hechanics; Reading, 1968), V.S. Varadarajan (Geometry of Quantum Theory: Princeton, 1968), and C. Piron (Foundations of Quantum Theory; New York, 1976). The initial program for the conference listed about twenty-five invited papers. But in the context of a very active and qualified attendance, other contributions were offered. This volume contains all of them. The program listed six main topics: I. Classification or different areas of quantum logic, and open problems. II. Comparison and unification of different approaches to quantum theories; problems of interpretation. III. Formal quantum logic; axiomatics. IV. Hodal interpretations of quantum logic. v vi FOREWORD V. Quantum set theory. (shrink)

Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic programs. During the computation of an answer set, systems are faced with choice points where they have to select a literal and assign it a truth value. Generally, systems utilize some heuristics to choose new literals at the choice points. The heuristic used is one of the key (...) factors for the performance of the system. A new heuristic for answer set programming has been developed. This heuristic is inspired by hierarchical planning. The notion of criticality, which was introduced for generating abstraction hierarchies in hierarchical planning, is used in this heuristic. The resulting system (CSMODELS) uses this new heuristic in a static way. CSMODELS is based on the system SMODELS. The experimental results show that this new heuristic is promising for answer set programming. A comparison of search times with SMODELS demonstrate CSMODELS’ usefulness. (shrink)

The European Summer Schools in Logic, Language and Information (ESSLLI) have been organised every year since 1989 under the auspices of the Association for Logic, Language and Information (FoLLI) in different cities around Europe. The 24th European Summer School in Logic, Language and Information (ESSLLI 2012) took place at the University of Opole, Poland, during August 6-17, 2012. The organisation committee was chaired by Janusz Czelakowski and Urszula Wybraniec-Skardowska (Institute of Mathematics and Informatics, University of Opole) and (...) the programme committee was chaired by Andreas Herzig (University of Toulouse and CNRS). During two weeks, over 340 participants from 36 countries were offered a rich academic program of their choice from 9 foundational, 16 introductory and 17 advanced courses and 6 workshops. Just as in the previous years, the 17th conference on Formal Grammar collocated with ESSLLI. Besides the regular courses, a traditional highlight of the summer school were the 4 evening lectures by distinguished academics: - Johan van Benthem (Institute for Logic, Language & Computation (ILLC), Amsterdam and Department of Philosophy, Stanford University), "Computation as Agency''; - Melvin Fitting (Department of Mathematics and Computer Science, City University of New York), "Reasoning About Games''; - Jonathan Ginzburg (UFR Études anglophones, Université Paris-Diderot (Paris 7)), "False starts, jokes, and music:semantics in the 21st century''; - Adam Przepiórkowski (Institute of Computer Science, Polish Academy of Sciences, Warsaw), "Secret life of corpora''. Another traditional event was the student session, organised by a student programme committee chaired by Rasmus K. Rendsvig (University of Copenhagen): master and doctoral students presented 16 papers and 5 posters, and Michał Zawidzki obtained the best paper award and Raul Fervari obtained the best poster award. Moreover, the Beth Dissertation Prizes were announced at the FoLLI General Meeting and went to Andreas Kapsner (University of Barcelona) and Daniel R. Licata (Carnegie Mellon University). Apart from the busy academic programme, participants of the summer school were offered an exciting social program as well. In addition to the traditional ESSLLI Party and the famous Students vs. Lecturers Soccer Match (also called `Johan van Benthem Cup'), kayaking, and excursions to Kraków and Wrocław were offered. -/- . (shrink)

The problem of psychologism in the philosophy of logic and the different solutions of this problem are considered. Both traditional psychologistic and antipsychologistic solutions are shown to be untenable and the need for a new solution is demonstrated. The original program of metapsychologism is advanced as a solution to the problem of psychologism based on deduction-search theory. Two formalized levels of a logical procedure are distinguished: 1) an object-level at which a notion of inference is formalized; 2) a metalevel (...) at which principles of deduction-search are formalized, and a thesis of metapsychologism according to which metalevel processes are formulated. Metapsychologism lifts usual psychologist considerations one level up in the hierarchy of logical procedure, while a nonpsychologist justification of logical relations is kept at the object-level. The application of the thesis of metapsychologism to different concrete logical procedures is considered. (shrink)

Since the late nineteenth century ‘Scientific Philosophy’ has become a label ascribed to many research programs. German theoretical philosophy of the early twentieth century was dominated by three different trends—Phenomenology, Neo-Kantianism, and Logical Empiricism: Each trend claimed to represent the ‘Scientific Philosophy’. In this context it is astonishing that we know almost nothing about the relationships between these schools. It is true, all of them rejected the speculative metaphysics found, for example, in German Idealism, but knowledge about other connections is (...) scarce. Starting with the question what exactly ‘Scientific Philosophy’ means and how these meanings relate to each other, a thorough investigation of the connections between all three trends has yet to take place.The main goal of the conference was, therefore, to better understand the relationships of these schools through their notions of ‘Scientific Philosophy’. In this context the works of Edmund Husserl (for Ph .. (shrink)

This volume is a collection of papers that explore various areas of common interest between philosophy, computing, and cognition. The book illustrates the rich intrigue of this fascinating recent intellectual story. It begins by providing a new analysis of the ideas related to computer ethics, such as the role in information technology of the so-called moral mediators, the relationship between intelligent machines and warfare, and the new opportunities offered by telepresnece, for example in teaching and learning. The book also ties (...) together the concerns of epistemology and logic, showing, for example, the connections between computers, bio-robotics, and scientific research and between computational programs and scientific discovery. Important results coming from recent computational models of deduction, the dynamic nature of meaning, and the role of reasoning and learning in spatial, visual and exemplar-based compuational frameworks are also addressed. Some stimulating papers carefully study how the interplay between computing and philosophy has also shed new light on the role of rational acceptance in the logic of belief and on the status of old philosophical topics like embodiment and consciousness, the role of information and the problem of realism in the new digital world. Finally, a considerable part of the book addresses the role of intenal and external representations in scientific reasoning and creative inferences as well as the place of manipulation of objects and artifacts in human cognition. Taking these topics together this book describes an aspect of an emerging agenda which is likely to carry the interaction between philosophy, cognition and computing forward into the twenty-first century. The volume is based on the papers that were presented at the International European Conference Computing and Philosophy, E-CAP2004, Italy, held at the University of Paiva, Paiv, Italy in June 2004, chaired by Lorenzo Magnani. (shrink)

Hilbert's conference lectures during the year 1922, Neuebegründung der Mathematik. Erste Mitteilung and Die logischen Grundlagen der Mathematik (both are published in (Hilbert [1935] 1965) pp. 157-195), contain his first public presentation of an axiom system for propositional logic, or at least for a fragment of propositional logic, which is largely influenced by the study on logical woks of Frege and Russell during the previous years.The year 1922 is at the beginning of Hilbert's foundational program in its (...) definitive form. The final public presentation by Hilbert of an axiom system for propositional logic is contained in the 1934 book Grundlagen der Mathematik, I (Hilbert and Bernays [1934] 1968). Sequent .. (shrink)

As a result of these restrictions, an implementation of L [subscript lambda] does not need to implement full higher-order unification. Instead, an extension to first-order unification that respects bound variable names and scopes is all that is required. Such unification problems are shown to be decidable and to possess most general unifiers when unifiers exist. A unification algorithm and logic programming interpreter are described and proved correct. Several examples of using L[subscript lambda] as a meta-programming language are (...) presented. (shrink)

It is shown that Gqp↑, the quantified propositional Gödel logic based on the truth-value set V↑ = {1 - 1/n : n≥1}∪{1}, is decidable. This result is obtained by reduction to Büchi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of Gqp↑ as the intersection of all finite-valued quantified propositional Gödel logics.

Provides a systematic introduction to the theory of logic programming and shows how this theory can be applied to reason about pure Prolog programs. The text includes an introduction to programming in Prolog and deals with such programming issues as determination, occur-check freedom and absence of errors. It covers both the natural interpretations of logic programming, as declarative specification and as procedure for computer execution.

This collection of current research on logic programming languages presents results from a three-year, ESPRIT-funded effort to explore the integration of the foundational issues of functional, logic, and object-oriented programming. It offers valuable insights into the fast-developing extensions of logic programming with functions, constraints, concurrency, and objects. Chapters are grouped according to the unifying themes of functional programming, constraint, logic programming, and object-oriented programming.

Doctoral programs at U.S. universities play a critical role in the development of human resources both in the United States and abroad. This volume reports the results of an extensive study of U.S. research-doctorate programs in five broad fields: physical sciences and mathematics, engineering, social and behavioral sciences, biological sciences, and the humanities. Research-Doctorate Programs in the United States documents changes that have taken place in the size, structure, and quality of doctoral education since the widely used 1982 editions. This (...) update provides selected information on nearly 4,000 doctoral programs in 41 subdisciplines at 274 doctorate-granting institutions. This volume also reports the results of the National Survey of Graduate Faculty, which polled a sample of faculty for their views on the scholarly quality of program faculty and the effectiveness of doctoral programs in preparing research scholars/scientists. This much-anticipated update of such an essential reference will be useful to education administrators, university faculty, and students seeking authoritative information on doctoral programs. (shrink)

"We argue that the computation of a logic program can be usefully divided into two distinct phases: the first being a proof- valued computation or proof-search; the second a residual computation, or answer extraction. Extension of extraction techniques to various theories then permits more extensive languages and proof procedures to be employed for the computational solution of problems. We illustrate these ideas with a simple propositional logic and show that SLD-resolution computes presentations of proofs in which the residual (...) computation may be interleaved with the proof-search, whereas a more general proof procedure yields shorter presentations of (the same) proofs, but which require more extensive residual computations.". (shrink)

(Click here for selected papers published before 1996, and here for papers published after 2000.) V. Lifschitz, Foundations of logic programming ," in Principles of Knowledge Representation , CSLI Publications, 1996, pp. 69-127. E. Giunchiglia, N. Kartha and V. Lifschitz, Representing action: indeterminacy and ramifications ," Artificial Intelligence , Vol. 95, 1997, pp. 409-443. V. Lifschitz, On the logic of causal explanation ," Artificial Intelligence , Vol. 96, 1997, pp. 451-465. V. Lifschitz, Two components of an action (...) language ," Annals of Mathematics and Artificial Intelligence , Vol. 21, 1997, pp. 305-320. V. Lifschitz, Situation calculus and causal logic ," in Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning, 1998, pp. 536-646. (shrink)

(Click here for the papers published between 1996 and 2000, and here for more recent papers.) V. Lifschitz, On the semantics of STRIPS ," in: Reasoning about Actions and Plans , 1987, pp. 1-9. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming ," in Logic Programming: Proceedings of the Fifth International Conference and Symposium , 1988, pp. 1070-1080.

The author narrates briefly the friendship that developed from his instruction of James Dean in the art of photography and documents the Dean personality with exclusive portraits.

In Minker and Rajasekar (J Log Program 9(1):45–74, 1990), Minker proposed a semantics for negation-free disjunctive logic programs that offers a natural generalisation of the fixed point semantics for definite logic programs. We show that this semantics can be further generalised for disjunctive logic programs with classical negation, in a constructive modal-theoretic framework where rules are built from _claims_ and _hypotheses_, namely, formulas of the form \(\Box \varphi \) and \(\Diamond \Box \varphi \) where \(\varphi \) is (...) a literal, respectively, yielding a “base semantics” for general disjunctive logic programs. Model-theoretically, this base semantics is expressed in terms of a classical notion of logical consequence. It has a complete proof procedure based on a general form of the cut rule. Usually, alternative semantics of logic programs amount to a particular interpretation of nonclassical negation as “failure to derive.” The counterpart in our framework is to complement the original program with a set of hypotheses required to satisfy specific conditions, and apply the base semantics to the resulting set. We demonstrate the approach for the answer set semantics. The proposed framework is purely classical in mainly three ways. First, it uses classical negation as unique form of negation. Second, it advocates the computation of logical consequences rather than of particular models. Third, it makes no reference to a notion of preferred or minimal interpretation. (shrink)

This reply to Oaksford and Chater’s ’s critical discussion of our use of logic programming to model and predict patterns of conditional reasoning will frame the dispute in terms of the semantics of the conditional. We begin by outlining some common features of LP and probabilistic conditionals in knowledge-rich reasoning over long-term memory knowledge bases. For both, context determines causal strength; there are inferences from the absence of certain evidence; and both have analogues of the Ramsey test. Some (...) current work shows how a combination of counting defeaters and statistics from network monitoring can provide the information for graded responses from LP reasoning. With this much introduction, we then respond to O&C’s specific criticisms and misunderstandings. (shrink)